Accurate computations with matrices related to bases {tieλt}
نویسندگان
چکیده
Abstract The total positivity of collocation, Wronskian and Gram matrices corresponding to bases the form ( e λ t , ,…, n ) is analyzed. A bidiagonal decomposition providing accurate numerical resolution algebraic linear problems with these derived. experimentation confirms accuracy proposed methods.
منابع مشابه
Accurate computations with Said-Ball-Vandermonde matrices
A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0, 1), then those matrices are strictly totally positive. An algorithm for computing the bidiagonal decomposition of those Said-Ball-Vandermonde matrices is presented, which allows to use known algorithms for totally positive mat...
متن کاملAccurate Computations with Totally Nonnegative Matrices
Is it possible to perform numerical linear algebra with structured matrices to high relative accuracy at a reasonable cost? In our talk we answer this question affirmatively for a class of structured matrices whose applications range from approximation theory to combinatorics to multivariate statistical analysis [1, 2, 4]—the Totally Nonnegative (TN) matrices, i.e. matrices all of whose minors ...
متن کاملAccurate computations with totally positive Bernstein-Vandermonde matrices
The accurate solution of some of the main problems in numerical linear algebra (linear system solving, eigenvalue computation, singular value computation and the least squares problem) for a totally positive Bernstein–Vandermonde matrix is considered. Bernstein–Vandermonde matrices are a generalization of Vandermonde matrices arising when considering for the space of the algebraic polynomials o...
متن کاملEla Accurate Computations with Totally Positive Bernstein–vandermonde Matrices
The accurate solution of some of the main problems in numerical linear algebra (linear system solving, eigenvalue computation, singular value computation and the least squares problem) for a totally positive Bernstein–Vandermonde matrix is considered. Bernstein–Vandermonde matrices are a generalization of Vandermonde matrices arising when considering for the space of the algebraic polynomials o...
متن کاملParallel Reduction of Matrices in Gröbner Bases Computations
Unfortunately the computation is time-and memory intensive. Mathematical knowledge is used to optimize the algorithms. Computer science provides another possibility to increase the computations: parallelization 2 / 24 Motivation Gröbner bases are used, to solve polynomial equation systems, move robotics, verify programs,. .. Unfortunately the computation is time-and memory intensive. Mathematic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Computational Mathematics
سال: 2022
ISSN: ['1019-7168', '1572-9044']
DOI: https://doi.org/10.1007/s10444-022-09954-2